منابع مشابه
Perfect Quantum Error Correcting Code.
We present a quantum error correction code which protects a qubit of information against general one qubit errors which maybe caused by the interaction with the environment. To accomplish this, we encode the original state by distributing quantum information over five qubits, the minimal number required for this task. We give a simple circuit which takes the initial state with four extra qubits...
متن کاملError-Correcting Keys in Relational Databases
Suppose that the entries of a relational database are collected in an unreliable way, that is the actual database may differ from the true database in at most one data of each individual. An error-correcting key is such a set of attributes, that the knowledge of the actual data of an individual in this set of attributes uniquely determines the individual. It is showed that if the minimal keys a...
متن کاملAlternate Labelings for Graphs Representing Perfect-One-Error-Correcting Codes
Alternate labelings for oneand two-dimensional graphs which support perfectone-error-correcting codes are provided, and their “efficiency” is compared with previously-known labelings using the concept of the finite state machine. These labelings are produced by altering the finite state machines used for recognition and error-correction for the previously known labelings. It is discovered that ...
متن کاملPerfect One Error Correcting Codes on Iterated Complete Graphs
Given an arbitrary graph, a perfect one error correcting code is a subset of the vertices called codewords such that no two codewords are adjacent and every non-codeword is adjacent to exactly one codeword. Determining if there is a perfect one error correcting code on an arbitrary graph seems di cult; in fact, it is NP-Complete. We present a biin nite family of graphs based on the complete gra...
متن کاملTwo-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect
Bose and Chaudhuri (1960) have introduced a class of binary errorcorrecting codes of block length 2 ~ 1, m = 2,3,• • which we refer to here as B-C codes. An efficient decoding scheme has been devised for them by Peterson (1960), and generalized to the natural extension of the B-C Codes to codes in pm symbols by D. Gorenstein and N. Zierler (1960). Two further properties of B-C codes are establi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90114-r